A Note on the Rate Region of Exact-Repair Regenerating Codes
نویسنده
چکیده
The rate region of the (5, 4, 4) exact-repair regenerating codes is provided. The outer bound is obtained through extension of the computational approach developed in an earlier work, and this region is indeed achievable using the canonical layered codes. This result is part of the online collection of “Solutions of Computed Information Theoretic Limits (SCITL)”.
منابع مشابه
Hybrid Regenerating Codes for Distributed Storage Systems
Distributed storage systems are mainly justified due to their ability to store data reliably over some unreliable nodes such that the system can have long term durability. Recently, regenerating codes are proposed to make a balance between the repair bandwidth and the storage capacity per node. This is achieved through using the notion of network coding approach. In this paper, a new variation ...
متن کاملOuter bounds for exact repair codes
We address the open problem of establishing the rate region for exact-repair regenerating codes for given parameters (n, k, d). Tian determined the rate region for a (4, 3, 3) code and found that it lies strictly within the functional-repair rate region. Using different methods, Sasidharan, Senthoor and Kumar prove a non-vanishing gap between the functional-repair outer bound and the exact-repa...
متن کاملOn the Achievability Region of Regenerating Codes for Multiple Erasures
We study the problem of centralized exact repair of multiple failures in distributed storage. We describe constructions that achieve a new set of interior points under exact repair. The constructions build upon the layered code construction by Tian et al in [1], designed for exact repair of single failure. We firstly improve upon the layered construction for general system parameters. Then, we ...
متن کاملCROSS-MBCR: Exact Minimum Bandwith Coordinated Regenerating Codes
We study the exact and optimal repair of multiple failures in codes for distributed storage. More particularly, we provide an explicit construction of exact minimum bandwidth coordinated regenerating codes (MBCR) for n = d + t, k, d ≥ k, t ≥ 1. Our construction differs from existing constructions by allowing both t > 1 (i.e., repair of multiple failures) and d > k (i.e., contacting more than k ...
متن کاملExact Regenerating Codes for Distributed Storage
Erasure coding techniques are used to increase the reliability of distributed storage systems while minimizing storage overhead. The bandwidth required to repair the system after a node failure also plays a crucial role in the system performance. In [1] authors have shown that a tradeoff exists between storage and repair bandwidth. They also have introduced the scheme of regenerating codes whic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1503.00011 شماره
صفحات -
تاریخ انتشار 2015